package com.bwt.tree;

public class BinaryTreeDemo {
	public static void main(String[] args) {
		BinaryTree binaryTree = new BinaryTree();
		HeroNode root = new HeroNode(1, "宋江");
		HeroNode node2 = new HeroNode(2, "吴用");
		HeroNode node3 = new HeroNode(3, "卢俊义");
		HeroNode node4 = new HeroNode(4, "林冲");
		HeroNode node5 = new HeroNode(5, "关胜");
		root.setLeft(node2);
		root.setRight(node3);
		node3.setRight(node4);
		node3.setLeft(node5);
		binaryTree.setRoot(root);

	/*	System.out.println("前序遍历");
		binaryTree.preOrder();

		System.out.println("中序遍历");
		binaryTree.infixOrder();

		System.out.println("后序遍历");
		binaryTree.postOrder();*/
		/* 前序遍历
		HeroNode{no=1, name='宋江'}
		HeroNode{no=2, name='吴用'}
		HeroNode{no=3, name='卢俊义'}
		HeroNode{no=5, name='关胜'}
		HeroNode{no=4, name='林冲'}
		中序遍历
		HeroNode{no=2, name='吴用'}
		HeroNode{no=1, name='宋江'}
		HeroNode{no=5, name='关胜'}
		HeroNode{no=3, name='卢俊义'}
		HeroNode{no=4, name='林冲'}
		后序遍历
		HeroNode{no=2, name='吴用'}
		HeroNode{no=5, name='关胜'}
		HeroNode{no=4, name='林冲'}
		HeroNode{no=3, name='卢俊义'}
		HeroNode{no=1, name='宋江'} */

		//4次
		/*System.out.println("前序遍历方式");
		HeroNode resNode = binaryTree.preOrderSearch(5);
		System.out.println(resNode == null ? "没有找到序号为5的英雄" : resNode);*/

		//3次
		/*System.out.println("中序遍历方式");
		HeroNode resNode = binaryTree.infixOrderSearch(5);
		System.out.println(resNode == null ? "没有找到序号为5的英雄" : resNode);*/

		/*System.out.println("后序遍历方式");
		HeroNode resNode = binaryTree.postOrderSearch(5);
		System.out.println(resNode == null ? "没有找到序号为5的英雄" : resNode);*/

		System.out.println("删除前,前序遍历");
		binaryTree.preOrder();
		binaryTree.delNode(3);
		System.out.println("删除后, 前序遍历");
		binaryTree.preOrder();

	}
}

//定义BinaryTree 二叉树
class BinaryTree {
	private HeroNode root;

	public void setRoot(HeroNode root) {
		this.root = root;
	}


	public void delNode(int no) {
		if (root != null) {
			//如果只有一个root节点, 这里立即判断root是不是要删除的节点
			if (root.getNo() == no) {
				root = null;
			} else {
				root.delNode(no);
			}
		} else {
			System.out.println("空树, 不能删除~");
		}
	}

	public HeroNode preOrderSearch(int no) {
		return root != null ? root.preOrderSearch(no) : null;
	}
	public HeroNode infixOrderSearch(int no) {
		return root != null ? root.infixOrderSearch(no) : null;
	}

	public HeroNode postOrderSearch(int no) {
		return root != null ? root.postOrderSearch(no) : null;
	}

	//前序遍历
	public void preOrder() {
		if (this.root != null) {
			this.root.preOrder();
		} else {
			System.out.println("二叉树为空,无法遍历");
		}
	}
	//中序遍历
	public void infixOrder() {
		if (this.root!=null) {
			this.root.infixOrder();
		}else {
			System.out.println("二叉树为空,无法遍历");
		}
	}

	//后序遍历
	public void postOrder() {
		if (this.root!=null) {
			this.root.postOrder();
		}else {
			System.out.println("二叉树为空,无法遍历");
		}
	}
}

//先创建HeroNode 节点
class HeroNode {
	private int no;
	private String name;
	private HeroNode left; //默认null
	private HeroNode right; //默认null


	//递归删除节点
	//1. 如果删除的节点是叶子节点, 则删除该节点
	//2. 如果删除的节点是非叶子节点, 则删除子树
	public void delNode(int no) {
		if (this.left != null && this.left.no == no) {
			this.left = null;
			return;
		}
		if (this.right != null && this.right.no == no) {
			this.right = null;
			return;
		}
		if (this.left != null) {
			this.left.delNode(no);
		}
		if (this.right != null) {
			this.right.delNode(no);
		}
	}

	//前序遍历查找
	public HeroNode preOrderSearch(int no) {
		System.out.println("前序遍历查找~~~");
		//比较当前节点是不是
		if (this.no == no) {
			return this;
		}
		//则判断当前节点的左子节点是不是为空, 非空则递归前序查找
		HeroNode resNode = null;
		if (this.left != null) {
			resNode = this.left.preOrderSearch(no);
		}
		if (resNode != null) {
			//非空结果为找到
			return resNode;
		}
		// 判断当前节点的右子节点是不是为空, 非空则递归前序查找
		if (this.right != null) {
			resNode = this.right.preOrderSearch(no);
		}
		return resNode;
	}

	//中序遍历查找
	public HeroNode infixOrderSearch(int no) {

		//则判断当前节点的左子节点是不是为空, 非空则递归中序遍历查找
		HeroNode resNode = null;
		if (this.left != null) {
			resNode = this.left.infixOrderSearch(no);
		}

		if (resNode != null) {
			//非空结果为找到
			return resNode;
		}
		//比较当前节点是不是
		System.out.println("中序遍历查找~~~~");
		if (this.no == no) {
			return this;
		}
		// 判断当前节点的右子节点是不是为空, 非空则递归中序遍历查找
		if (this.right != null) {
			resNode = this.right.infixOrderSearch(no);
		}
		return resNode;
	}

	//后序遍历查找
	public HeroNode postOrderSearch(int no) {
		//则判断当前节点的左子节点是不是为空, 非空则递归后序遍历查找
		HeroNode resNode = null;
		if (this.left != null) {
			resNode = this.left.postOrderSearch(no);
		}

		if (resNode != null) {
			//非空结果为找到
			return resNode;
		}
		// 判断当前节点的右子节点是不是为空, 非空则递归后序遍历查找
		if (this.right != null) {
			resNode = this.right.postOrderSearch(no);
		}
		if (resNode != null) {
			//非空结果为找到
			return resNode;
		}
		//比较当前节点是不是
		System.out.println("后续遍历查找~~~");
		if (this.no == no) {
			return this;
		}
		return resNode;

	}



	//前序遍历
	public void preOrder() {
		//先输出父节点
		System.out.println(this);
		//递归向左子树遍历
		if (this.left != null) {
			this.left.preOrder();
		}
		//递归向右子树前序遍历
		if (this.right != null) {
			this.right.preOrder();
		}
	}

	//中序遍历
	public void infixOrder() {
		//递归向左子树遍历
		if (this.left != null) {
			this.left.infixOrder();
		}
		//先输出父节点
		System.out.println(this);
		//递归向右子树前序遍历
		if (this.right != null) {
			this.right.infixOrder();
		}
	}

	//后序遍历
	public void postOrder() {
		//递归向左子树遍历
		if (this.left != null) {
			this.left.postOrder();
		}
		//递归向右子树前序遍历
		if (this.right != null) {
			this.right.postOrder();
		}
		//先输出父节点
		System.out.println(this);

	}


	public HeroNode(int no, String name) {
		this.no = no;
		this.name = name;
	}

	public int getNo() {
		return no;
	}

	public void setNo(int no) {
		this.no = no;
	}

	public String getName() {
		return name;
	}

	public void setName(String name) {
		this.name = name;
	}

	public HeroNode getLeft() {
		return left;
	}

	public void setLeft(HeroNode left) {
		this.left = left;
	}

	public HeroNode getRight() {
		return right;
	}

	public void setRight(HeroNode right) {
		this.right = right;
	}

	@Override
	public String toString() {
		return "HeroNode{" +
				"no=" + no +
				", name='" + name + '\'' +
				'}';
	}
}
